Uncoercible Communication and Deniable Encryption, or How to Lie With Impunity
نویسنده
چکیده
Use of some cryptographic protocols implies a commitment to the data operated on by those protocols. For example, a digital signature may ensure the property of nonrepudiation: the signer would be unable to claim that the signed document is a forgery. Similarly, encrypting data can form a kind of commitment to the data: the decryption process reveals the committed plaintext. In some scenarios, commitment to a plaintext may be undesirable. For example, in an election setting, we would like to prevent voters from being able to generate proof of their votes, ensuring that they cannot be coerced into voting a certain way, or rewarded for doing so. A secret agent may wish to be able to communicate with her sponsoring organization freely even if a coercive adversary is applying pressure to have her send a particular message. A corporate employee may wish to act as a whistle-blower without fear of management reprisal for having disclosed sensitive information. A variety of techniques have been developed in recent years to provide various cryptographic services, including privacy, without implying a commitment to the plaintext, even under coercive circumstances. We examine a variety of techniques in this vein. But first, we should establish some informal definitions. Coercion occurs when one party forces another, through physical threats, monetary or other rewards, legal action, or other pressure to follow certain behavior. Coercion can occur before, during or after a transaction of interest. Multiple parties involved in a transaction may be coerced, by the same or different adversaries, and each may be asked to follow different behavior. Uncoercible protocols specify a faking algorithm which the coerced party may follow under coercion, which makes it impossible for her to prove to the adversary that she has followed the coercive instructions, or equivalently, to provide the coercer with a forged receipt indicating compliance which is indistinguishable from an actual non-forged receipt. Since uncoercible protocols make it impossible to prove something to the adversary, the coerced party has several options.
منابع مشابه
A Method for Obtaining Deniable Public-Key Encryption
Deniable encryption is an important notion that allows a user (a sender and/or a receiver) to escape a coercion attempted by a coercive adversary. Such an adversary approaches the coerced user after transmission forcing him to reveal all his random inputs used during encryption or decryption. Since traditional encryption schemes commits the user to his random inputs, the user is forced to revea...
متن کاملLower and Upper Bounds for Deniable Public-Key Encryption
A deniable cryptosystem allows a sender and a receiver to communicate over an insecure channel in such a way that the communication is still secure even if the adversary can threaten the parties into revealing their internal states after the execution of the protocol. This is done by allowing the parties to change their internal state to make it look like a given ciphertext decrypts to a messag...
متن کاملDeniable Encryption
Consider a situation in which the transmission of encrypted messages is intercepted by an adversary who can later ask the sender to reveal the random choices (and also the secret key, if one exists) used in generating the ciphertext, thereby exposing the cleartext. An encryption scheme is deniable if the sender can generate ‘fake random choices’ that will make the ciphertext ‘look like’ an encr...
متن کاملStream Deniable-Encryption Algorithms
A method for stream deniable encryption of secret message is proposed, which is computationally indistinguishable from the probabilistic encryption of some fake message. The method uses generation of two key streams with some secure block cipher. One of the key streams is generated depending on the secret key and the other one is generated depending on the fake key. The key streams are mixed wi...
متن کاملA New Sender-Side Public-Key Deniable Encryption Scheme with Fast Decryption
Deniable encryption, introduced in 1997 by Canetti, Dwork, Naor, and Ostrovsky, guarantees that the sender or the receiver of a secret message is able to “fake” the message encrypted in a specific ciphertext in the presence of a coercing adversary, without the adversary detecting that he was not given the real message. Sender side deniable encryption scheme is considered to be one of the classi...
متن کامل